Determining priority between data items

ABSTRACT

One embodiment of the present invention enables nodes or endpoints involved with synchronization of data items to determine which version of a data item (if any) has priority over another version of that same data item. Within the present embodiment, when a data item Is modified by a node, it is presumed that the modified data item takes priority aver the previous version of that data item. Therefore, the “descendant” data item (modified) takes precedence over its “ancestor” data item (previous version). By including this type of “pedigree” information with data items involved with synchronization between different nodes or endpoints, the present embodiment enables the endpoints to determine which version of a data item (if any) has priority over another version of that same data item.

CROSS REFERENCE TO RELATED APPLICATIONS

This application is a continuation application of application Ser. No. 10/159,461, entitled “DETERMINING PRIORITY BETWEEN DATA ITEMS,” filed May 31, 2002, now allowed, which claims priority to Provisional Application Ser. No. 60/377,713, entitled “SYSTEM AND METHOD FOR SYNCHRONIZING COMPUTER DATABASES,” filed May 2, 2002. The subject matter in the above-identified co-pending and commonly owned application(s) is incorporated herein by reference.

TECHNICAL FIELD

The present invention relates generally to the field of databases. Specifically, the present invention relates to the field of synchronizing data between multiple nodes.

BACKGROUND ART

In the realm of handheld computer systems (commonly referred to as personal digital assistants or PDAs), it is not uncommon for a data set to exist and be maintained both on the PDA and on at least one other computing device. For example, a user may maintain a calendar or address book on both his or her PDA and on another computer system (e.g., a personal computer system such as a desktop or laptop).

The entries in the data set can be referred to as records or data objects. When a change is made to a record in the data set residing on one device (hereinafter, also referred to as a node), it is desirable to have the data set on the other node be updated as well, so that the data set is synchronized on both nodes. Accordingly, processes have been developed to facilitate synchronizing the data sets on both nodes. These synchronization (“sync”) processes are known in the art.

Currently, each record in a data set may be identified by a unique record identifier (record ID). To prevent duplication of record IDS, the task of assigning IDS to records is relegated to the PDA.

Generally, synchronization is performed using either a “slow sync” technique or a “fast sync” technique. Using a slow sync, all of the records are transferred between nodes; the data set on one node is transferred to the other. The records in each data set are then compared in order to determine which records have changed since the last sync, and the respective data sets are updated accordingly.

Fast syncs are accommodated by tagging records when they are modified. Typically, a bit associated with each record is set to one value or another to indicate whether or not that record has been changed since the last sync; the bits that have been set are often referred to as “dirty” bits. Using a fast sync, only the changes made to the data set on each node since the last sync are transferred to the other node. After the fast sync is performed, the dirty bits are cleared.

Although fast syncs are preferred, there are occasions when slow syncs need to be performed. For instance, it is becoming more common for people to use more than one computer system. Many people use a computer system at home and another one at work, for example. If a user performs a fast sync between the PDA and one of the computer systems, the dirty bits would be cleared. Consequently, the records on the PDA that have changed cannot be identified using the dirty bits. Therefore, a subsequent sync between the PDA and another computer system will use a slow sync to identify changes made to the records since the last time these latter two nodes had been synched.

Thus, one problem with the common synchronization techniques is that slow syncs are occurring more frequently as a growing number of people interact with multiple computer systems with their PDA. Slow syncs take longer to complete than fast syncs, and so they are less desirable. Also, the time needed to complete slow syncs is increasing as memory sizes increase for PDAs.

Another issue with typical synchronization techniques is that they are limited with respect to the different types of syncs that can now occur. Traditionally, synchronization occurs between a PDA and one or mare personal computer systems as described above. However, the paradigm in which the PDA serves in essence as the nexus between the user's home and office computer systems is not as applicable as it once was. As computer systems are networked, multiple communication pathways between PDAs and computer systems can exist, and synchronization between multiple devices needs to be supported. The notion of a single source (e.g., the PDA) for record IDS is not as workable as before.

Also, records are frequently shared between users and quite often are distributed and stored across many nodes. Some records may be accessible by multiple users working from different nodes. In any event, different users may update a record in different ways, and the modified record may be distributed over different pathways. Along the way, the record may be further modified. As a result, different versions of the same record may reach a node, causing a conflict to arise as to which version of the record should take precedence over another. Using contemporary synchronization techniques, these records are unnecessarily replicated at the destination node, slowing down syncs while consuming memory. User intervention is then usually required to glean which records are correct and which can be discarded.

SUMMARY OF THE INVENTION

Accordingly, given that different versions of the same record may reach a node, a need exists for a method and/or system that enables the node to more easily determine which version of the record (if any) takes precedence over the others. The present invention provides one or more embodiments which accomplish the above mentioned need.

Specifically, one embodiment of the present invention enables nodes or endpoints involved with synchronization of data items to determine which version of a data item (if any) has priority over another version of that same data item. Within the present embodiment, when a data item is modified by a node, it is presumed that the modified data item takes priority over the previous version of that data item. Therefore, the “descendant” data item (modified) takes precedence over its “ancestor” data item (previous version). By including this type of “pedigree” information with data items involved with synchronization between different nodes or endpoints, the present embodiment enables the endpoints to determine which version of a data item (if any) has priority over another version of that same data item.

In another embodiment, the present invention provides a method for determining priority between two data items during a synchronization process between two nodes. The method includes determining if any data items have matching identities during the synchronization process. Furthermore, the method includes determining if the content of a first and second data items are unequal, in response to the first and second data items having matching identities. Additionally, the method includes determining whether the first data item descended from the second data item, in response to the content of the first and second data items being unequal. The method also includes determining that the first data item has priority over the second data item, in response to the first data item descending from the second data Item.

In yet another embodiment, the present invention includes a computer implemented method for determining priority between two data items during a synchronization process between two nodes. The computer implemented method includes determining whether a first and second data items have matching identities during the synchronization process. Additionally, the computer implemented method includes determining if the content of the first and second data items are unequal. The computer implemented method also includes determining whether the first data item descended from the second data item, in response to the first and second data items having matching identity and the content of the first and second data items being unequal. Moreover, the computer implemented method includes determining that the first data item has priority over the second data item, in response to the first data item descending from the second data item.

In still another embodiment, the present invention includes a computer-usable medium having computer-readable code embodied therein for causing a computing device to perform particular operations. The computer-usable medium causes the computing device to perform: deciding if a first and second data items have matching identities during a synchronization process between two nodes; deciding if the content of the first and second data items are unequal; deciding if the first data item descended from the second data item, in response to the first and second data items having matching identities and the content of the first and second data items being unequal; and deciding that the first data item has priority over the second data item, in response to the first data item descending from the second data item.

The present invention provides these advantages and others which will no doubt become obvious to those of ordinary skill in the art after having read the following detailed description of embodiments in accordance with the present invention.

BRIEF DESCRIPTION OF THE DRAWINGS

The accompanying drawings, which are incorporated in and form a part of this specification, illustrate embodiments of the invention and, together with the description, serve to explain the principles of the invention.

FIG. 1A is a block diagram of an exemplary handheld computer system upon which embodiments of the present invention may be practiced.

FIG. 1B is a block diagram of an exemplary computer system upon which embodiments of the present invention may be practiced.

FIG. 2 is a flowchart containing steps performed in accordance with an embodiment of the present invention for utilizing a synchronization counter (or sync clock) and a pedigree of a data atom.

FIG. 3 is a flowchart containing steps performed in accordance with an embodiment of the present invention for enabling determination of priority between two data atoms.

FIG. 4 is a flowchart containing steps performed in accordance with an embodiment of the present invention for handling data atoms that have been deleted by a node.

FIG. 5 is a flowchart containing steps performed in accordance with an embodiment of the present invention for enabling a node to manage completely deleted data atoms.

DETAILED DESCRIPTION OF THE INVENTION

Reference will now be made in detail to embodiments of the invention, examples of which are illustrated in the accompanying drawings. While the invention will be described in conjunction with embodiments, it will be understood that they are not intended to limit the invention to these embodiments. On the contrary, the invention is intended to cover alternatives, modifications and equivalents, which may be included within the spirit and scope of the invention as defined by the appended claims. Furthermore, in the following detailed description of the present invention, numerous specific details are set forth in order to provide a thorough understanding of the present invention. However, it will be obvious to one of ordinary skill in the art that the present invention may be practiced without these specific details. In other instances, well known methods, procedures, components, and circuits have not been described in detail as not to unnecessarily obscure aspects of the present invention.

Notation and Nomenclature

Some portions of the detailed descriptions which follow are presented in terms of procedures, logic blocks, processing, and other symbolic representations of operations on data bits within a computing system or digital system memory. These descriptions and representations are the means used by those skilled in the data processing arts to most effectively convey the substance of their work to others skilled in the art. A procedure, logic block, process, etc., is herein, and generally, conceived to be a self-consistent sequence of steps or instructions leading to a desired result. The steps are those requiring physical manipulations of physical quantities. Usually, though not necessarily, these physical manipulations take the form of electrical or magnetic signals capable of being stored, transferred, combined, compared, and otherwise manipulated in a computing system or similar electronic computing device. For reasons of convenience, and with reference to common usage, these signals are referred to as bits, values, elements, symbols, characters, terms, numbers, or the like with reference to the present invention.

It should be borne in mind, however, that all of these terms are to be interpreted as referencing physical manipulations and quantities and are merely convenient labels and are to be interpreted further in view of terms commonly used in the art. Unless specifically stated otherwise as apparent from the following discussions, it is understood that throughout discussions of the present invention, discussions utilizing terms such as “advancing” or “determining” or “deciding” or “synchronizing” or “incrementing” or “deleting” or “transmitting” or “receiving” or “modifying” or “generating” or “utilizing” or “storing” or the like, refer to the action and processes of a computing system, or similar electronic computing device, that manipulates and transforms data. The data is represented as physical (electronic) quantities within the computing system's registers and memories and is transformed into other data similarly represented as physical quantities within the computing system's memories or registers or other such information storage, transmission, or display devices.

Exemplary Implementation Platforms

FIG. 1A is a block diagram of an embodiment of a device 100 upon which embodiments of the present invention may be implemented. In one embodiment, device 100 is a handheld computer system often referred to as a personal digital assistant (PDA) or a portable information device (PIP). In its various implementations, device 100 may not include all of the elements illustrated by FIG. 1A, or device 100 may include other elements not shown by FIG. 1A.

In one embodiment, device 100 includes an address/data bus 111 for communicating information, a central processor 101 coupled with the bus 111 for processing information and instructions, a volatile memory 103 (e.g., random access memory, RAM) coupled with the bus 111 for storing information and instructions for the central processor 101, and a non-volatile memory 102 (e.g., read only memory, ROM) coupled with the bus 111 for storing static information and instructions for the processor 101. in the present embodiment, device 100 also includes an optional data storage device 104 (e.g., a Secure Digital card, a Multi Media Card, or the like) coupled with the bus 111 for storing information and instructions. Device 104 can be removable. In one embodiment, device 100 also contains a display device 107 coupled to the bus 111 for displaying information to a user.

In the present embodiment of FIG. 1A, device 100 also includes a signal transmitter/receiver (transceiver) device 110, which is coupled to bus 111 for providing a wireless radio (RF) communication link between device 100 and other wireless devices. It is understood that transceiver 110 may be coupled to device 100 or integral with device 100.

In one embodiment, device 100 includes host interface circuitry 105 coupled to bus 111. Host interface circuitry 105 includes an optional digital signal processor (DSP) 106 for processing data to be transmitted or data that are received via transceiver 110. Alternatively, processor 101 can perform some or all of the functions performed by DSP 106. In one embodiment, host interface circuitry 105 comprises a universal asynchronous receiver-transmitter (UART) module that provides the receiving and transmitting circuits utilized for serial communication for both the serial port 113 and the infrared (IR) port 112.

In one embodiment, device 100 of FIG. 1A also includes an optional alphanumeric input device 108 that, in one implementation, is a handwriting recognition pad (“digitizer”). Alphanumeric input device 108 can communicate information and command selections to processor 101 via bus 111. In one embodiment, device 100 also includes an optional cursor control or directing device (on-screen cursor control 109) coupled to bus 111 for communicating user input information and command selections to processor 101. In one implementation, onscreen cursor control device 109 is a touch screen device incorporated with display device 107.

Refer now to FIG. 1B that illustrates an exemplary computer system 120 upon which embodiments of the present invention may be practiced. In its various implementations, system 120 may not include all of the elements illustrated by FIG. 1B, or system 120 may include other elements not shown by FIG. 1B.

In general, computer system 120 comprises bus 130 far communicating information, processor 121 coupled with bus 130 for processing information and instructions, volatile memory (e.g., RAM) 123 coupled with bus 130 for storing information and instructions for processor 121, non-volatile memory (e.g., ROM) 122 coupled with bus 130 for storing static information and instructions for processor 121, data storage device 124 such as a magnetic or optical disk and disk drive coupled with bus 130 for storing information and instructions, an optional user output device such as display device 125 coupled to bus 130 for displaying information to the computer user, an optional user input device such as alphanumeric input device 126 including alphanumeric and function keys coupled to bus 130 for communicating information and command selections to processor 121, and an optional user input device such as cursor control device 127 coupled to bus 130 far communicating user input information and command selections to processor 121. Furthermore, input/output (I/O) device 128 is used to communicatively couple computer system 120 to another device (e.g., device 100 of FIG. 1A). It is understood that 110 device 128 may be a device used far wired communication and/or for wireless communication.

Exemplary Operation in Accordance with the Present Invention

Synchronization is generally a process by which a plurality of copies of a database are maintained such that the information in ail copies is the same, or synchronized. The copies need not be bit for bit identical. A synchronization process can accommodate different file structure, operating system and data media requirements. The copies are frequently on different computer systems, but it is sometimes desirable to maintain separate, synchronized databases on the same computer system. Synchronization allows, for example, additions, deletions and/or changes made to one copy of a database (also known as mutations), for example a copy on a handheld computer, to be reflected to all copies.

These database copies are generally known as “endpoints” (or “farpoints” or “nodes”). At other times, the term “node” may be used to describe an entity, far example a computer system, comprising multiple endpoints. An endpoint is generally a source or destination of records (individual data items) to be synchronized. For example, it is commonplace to synchronize a desktop calendar system database with a calendar database on a handheld computer. In this example, the calendar database on the desktop computer is an endpoint, and the handheld calendar database is another endpoint. Endpoints are generally data structures in permanent, or semi-permanent computer memory, such as battery powered RAM in a handheld computer or magnetic media within a desktop computer. However, endpoints may be temporary, for example, a buffer in a wireless data protocol stack.

The entries in a data set can be referred to as records, data objects, or data items. When a change is made to a record in the data set residing on one device or node such as handheld computer 100, It is desirable to have the same data set on another device or node such as computer system 120 be updated as well, so that the data set is synchronized on both nodes. Within an embodiment of the present invention, the first abstraction applied to this type of synchronization is to model the data flow. Each place that stores data, even if only transiently, is modeled as a node. Nodes that exchange data are coupled nodes. Handheld device 100 is a node. More specifically, its data store may be a node. A desktop viewer (such as Palm Desktop) with its data cache is a node. A data-sharing server is a node. A HotSync between Palm Desktop and a cradled handheld is a coupling edge between the two nodes.

It is noted that if a sync flow graph contains loops, then it is possible for a given piece of data to arrive at a node via two different pathways and with arbitrary timing. If the data from the two pathways differs, then the task of resolving the difference may potentially need more information about the sequence, timing, and locale of changes made to the data enroute.

Within an embodiment of the present embodiment, another abstraction applied to synchronization is to model the data as independent atoms. This abstraction leaves out the notions of data creation and destruction. It assumes the data already exists and is getting modified and passed along. A data atom may have two properties of interest. It has an identity and it has comparable content.

The identity property means that two data atoms can be examined and it can be determined that they represent either the same piece of data, or not. The content property means that two data atoms with matching identity can be further compared for content. Within an embodiment, the content is either equal, or it is not, it should be noted that a data atom may be, but is not limited to, a record or a field of a record, Since both may be identified and compared for content, either one may be a data atom.

When a data atom is modified, it may be referred to as a mutation. Copies may or may not get exchanged, perhaps unidirectionally, when nodes communicate. When a data atom is modified, the original may be referred to as the ancestor and the mutation is referred to as the descendant. The concept extends to multiple generations of mutations. Furthermore, a mutation is presumed desirable. That is, some user or some knowledgeable process changed the data intentionally with a fidelity expectation that the system would retain that change. Therefore, priority may be presumed for any mutation over any of its ancestors. This presumption may be referred to as the presumption of deliberateness

When a node has two data atoms with equal identity but unequal content, that is referred to as a disparity. There may be two kinds of disparities. In an ordered disparity, one of the atoms is the ancestor of a descendant derived by one or more mutations from the ancestor. The presumption of deliberateness allows us to assign priority to the descendant.

The second kind of disparity is an unordered disparity. Neither data atom is the descendant of the other and may not be resolved via the presumption of deliberateness. An unresolved disparity, whether ordered or unordered, is a conflict. An ordered disparity may be resolved without violating fidelity expectations by removal of the ancestor and retention of the descendant. However, an unordered disparity may not be resolved without violating some previous fidelity expectation. Within an embodiment, unordered disparities may be resolvable by an external agent, who possess additional information. It should be understood that the external agent acts on the data to produce a mutation it favors, thus introducing the missing “deliberateness” needed to resolve a disparity. Functionally, sync resolves ordered disparities while detecting unordered disparities.

An embodiment of the present invention enables nodes or endpoints involved with synchronization of data items to determine which version of a data item or atom (if any) has priority over another version of that same data item. When a data item is modified by a node, it is presumed that the modified data item takes priority over the previous version of that data item or atom. Therefore, the “descendant” data item (modified) takes precedence over its “ancestor” data item (previous version). By including this type of “pedigree” information with data items involved with synchronization between different nodes or endpoints, the present embodiment enables determination as to which version of a data item (if any) has priority over another version(s) of that same data item.

Specifically, a “pedigree” is generally a change history of a data atom, and may be used to indicate if the data atom has changed since a synchronization session. Within the present embodiment, a “synchronization counter” or “sync counter” may be used to establish a pedigree of a data atom, it is noted that the sync counter may also be referred to as a “synchronization clock” or “sync clock.” According to an embodiment of the present invention, a sync counter may be a positive integer value that increases monotonically with each synchronization action. It should be appreciated that the value of a synchronization counter need have no relation to actual time. A synchronization counter may be viewed as a label for a period of time between synchronizations.

Furthermore, a sync counter may be maintained for an individual database or node. Such individual sync counters may be useful when databases are synchronized within a computer device or when all databases are not synchronized at the same time. A single sync counter may also be maintained by and for a single computer system. A sync counter should be advanced at each synchronization (unless no changes have occurred since a prior synchronization). However, the sync counter may be advanced more frequently, for example at each synchronization or at each modification of a data atom. Alternatively, the sync counter may just be advanced when the first data atom is modified within a node after a sync.

Using sync counters, a pedigree may be created by combining the count of a sync counter and an identifier of a node, a database or a device. This information is then associated with a data atom when the data atom is created or modified. For example, a desk top computer (e.g., 120) may use the letter “D” as its identifier. When a database record, e.g., an appointment is created, the sync counter may have a value of “21.” Consequently, the database record may be assigned a pedigree of “D21” to indicate that the record was created on the desk top computer “D” while the desk top computer's sync counter was 21.

As another example, assume that the desk top computer (e.g., 120) synchronizes with a handheld computer (e.g., 100), receiving a copy of the exemplary appointment data record during the process. A change to this record performed on handheld computer 100 may append handheld computer 100's identification and value of its current sync counter to previously included pedigree information. Thus, the pedigree for the now modified data record may be “D21H43,” where the “H43” portion represents an Identifier for the handheld computer “H” and the value of its sync counter “43” at the time of the modification. It is appreciated that the present embodiment is well suited to include an identifier and sync counter value with previous pedigree information of a data atom, record, or data object in a wide variety of ways. For example, the present embodiment may append, prepend and/or utilize mathematical combinations in order to include an identifier and sync counter value with previous pedigree information of a data atom.

It should be appreciated that it is possible, in some systems perhaps common, that two data atoms that are unordered because they separately mutated from a common ancestor, can mutate to become equal in content. For example, someone's phone number changes and is updated in two separate mode locations which are later synced. In this case, there is no disparity but the data atoms have a different pedigree. The present embodiment allows the two data atoms to be merged into a single data atom with merged pedigree. This merged atom then has priority over the ancestors of either original data atom.

Within the present embodiment, an external agent or process that seeks to resolve conflicts may do so by means of convergent mutations. For example, if an address book entry has two mutations, one with a changed phone extension and one with a changed email, an intelligent agent might choose to resolve the conflict by producing a blended address book entry that includes both the changed phone extension and the changed email. The desired goal is for the blended entry to have priority over both original mutations. Therefore, both items mutate into a new blended content that includes the combined pedigree resulting in a convergent mutation.

FIGS. 2, 3, 4 and 5 each include flowcharts 200, 300, 400 and 500, respectively, of steps performed in accordance with embodiments of the present invention. Flowcharts 200, 300, 400 and 500 each includes processes of the present invention which, in one embodiment, are carried out by a processor(s) and electrical components under the control of computer readable and computer executable instructions. The computer readable and computer executable instructions may reside, for example, in data storage features such as computer usable volatile memory 123, computer usable non-volatile memory 122 and/or computer usable mass data storage device 124. However, the computer readable and computer executable instructions may reside in any type of computer readable medium. Although specific steps are disclosed in flowcharts 200, 300, 400 and 500, such steps are exemplary. That is, the present invention is well suited to performing various other steps or variations of the steps recited in FIGS. 2, 3, 4 and 5. It should be appreciated that the steps of flowcharts 200, 300, 400 and 500 may each be performed by software, by hardware or by any combination of software and hardware.

FIG. 2 includes flowchart 200 containing steps performed in accordance with an embodiment of the present invention for utilizing a synchronization counter (or sync clock) and a pedigree of a data atom. Specifically, when a data atom at a data node mutates it is marked with the current node identity and value of that node's sync counter. This marking does not replace the markings from any different sync counter, but it may replace any older marking from the current sync counter. The pedigree of a data atom may then be coded as all of the different nodes at which It has mutated along with the counter value of its most recent mutation at that node.

Additionally, marking a data atom with a sync counter asserts deliberateness. It states that a user or other external agent mutated a data atom with an expectation (fidelity) that the mutation would be preserved over any previous value that data atom had at that node. A system for detecting and resolving disparities within the present embodiment usually depends upon a mark having this type of meaning. It is noted that the pedigree marks should be made when the presumption of deliberateness is valid. The pedigree information of a data atom is the set of sync counter markings attached to it.

At step 202, a sync counter of a node is initialize to a value equal to zero. In step 204, the present embodiment determines whether a data atom has been modified within the node. If the present embodiment determines that a data atom has not been modified within the node at step 204, it proceeds to the beginning of step 204. However, if the present embodiment determines that a data atom has been modified within the node at step 204, it proceeds to step 206.

At step 206 of FIG. 2, the present embodiment advances the node sync counter value by one. It is appreciated that the node sync counter of the present embodiment is advanced with an integer value. However, the present embodiment is well suited to have the node sync counter value advanced in a wide variety of ways. For example, the node sync counter value may be advanced with any type of floating point number or integer number. Alternatively, the node sync counter value may be advanced by sampling a real-time clock value.

Within flowchart 200, the sync counter is advanced when any data atom is modified. However, the present embodiment is well suited for implementations that advance (or increment) less frequently so long as the sync counter is advanced the first time a data atom is modified after a sync. It is understood that the sync counter of flowchart 200 may be advanced (or incremented) in any manner described herein.

In step 208, the present embodiment includes the node's identity and its current sync counter value with the pedigree of the modified data atom. Once step 208 has been completed, the present embodiment proceeds to the beginning of step 204.

FIG. 3 includes flowchart 300 containing steps performed in accordance with an embodiment of the present invention for enabling determination of priority between two data atoms. Specifically, comparing the sync counter markings for two data atoms is sufficient to determine whether one is descendant from the other. For example, for each sync counter marking attached to an ancestor data atom, a descendant data atom may have the same sync counter with an equal or greater value. In another case (e.g., unordered disparity), a sibling atom may have at least one sync counter marking of lower value and one sync marking of higher value.

In step 302, the present embodiment determines whether the identities of two data atoms match. If the present embodiment determines that the identities of the two data atoms do not match, it proceeds to the beginning of step 302. However, if the present embodiment determines that the identities of the two data atoms do match at step 302, it proceeds to step 304.

At step 304, the present embodiment determines whether the content of the two data atoms are equal. If the present embodiment determines that the content of the two data atoms are equal, it proceeds to the beginning of step 302. However, if the present embodiment determines that the content of the two data atoms are unequal at step 304, it proceeds to step 306.

In step 306 of FIG. 3, the present embodiment determines which data atom has priority by using each of their pedigrees. it is understood that the pedigrees of both data atoms are compared by the present embodiment in order to determine which data atom is the descendant and which one is the ancestor. This determination at step 306 may be done in any manner described herein. Once this is determined, it is appreciated that the descendant data atom takes priority over its ancestor data atom. At step 308, the present embodiment deletes (or disregards) the ancestor data atom and stores (or uses) the descendant data atom far future use. Once step 308 is completed, the present embodiment proceeds to the beginning of step 302.

It is understood that the process of flowchart 300 may occur within a node during (or as part of) a synchronization process between the node and another node. Alternatively, the process of flowchart 300 may occur within a node after a synchronization process between the node and another node.

FIG. 4 includes flowchart 400 containing steps performed in accordance with an embodiment of the present invention for handling data atoms that have been deleted within a node. It should be appreciated that it may become burdensome to a node to maintain complete data atoms of which have been previously deleted within the node. As such, flowchart 400 may be viewed as an optimization process. Specifically, flowchart 400 optimizes storage of deleted data atoms by saving their identity information, deleted status and their pedigrees while deleting any other information associated with them. Therefore, when a sync process occurs with another node, it may also optimize its storage of deleted data atoms.

In step 402, the present embodiment determines whether a data atom has been deleted within a node. If the present embodiment determines that a data atom has not been deleted within the node at step 402, it proceeds to the beginning of step 402. However, If the present embodiment determines that a data atom has been deleted within the node at step 402, it proceeds to step 206. At step 206, as described herein, the present embodiment advances the node sync counter value by one. However, the value of the node sync counter may be advanced (or incremented) in a wide variety of ways in accordance with the present embodiment. For example, the value of the node sync counter may be advanced in any manner described herein.

At step 404 of FIG. 4, the present embodiment includes the node identity and sync counter value with the pedigree of the deleted data atom. In step 406, the present embodiment deletes all of the data associated with the deleted data atom except for its identity, deleted status and its pedigree which all may be referred to as a deleted data atom “stub”. In this manner, when a sync process occurs with another node, that node may also optimize its storage by modifying the “deleted” data atom into a deleted data atom “stub”. Additionally, this prevents the “deleted” data atom from being re-established within the node that initially deleted it. Once step 406 is completed, the present embodiment exits flowchart 400.

FIG. 5 includes flowchart 500 containing steps performed in accordance with an embodiment of the present invention for enabling a node to manage completely deleted data atoms. Specifically, flowchart 500 enables further optimization by completely removing deleted data atoms from a node by utilizing a determined pedigree of sync counters to designate which data atoms to remove. The pedigree of sync counters is utilized to create a special exclude link which subsequently indicates to one or more nodes which type of data atoms were completely removed.

It is noted that flowchart 500 specifically operates with deleted data atom “stubs” (that include each data atom's identity, delete status and pedigree). However, flowchart 500 is well suited to operate with data atoms that are to be deleted in the same manner it operates with deleted data atom “stubs”.

In step 502, the present embodiment determines whether there are too many deleted data atom “stubs” within the node. If the present embodiment determines that there are not too many deleted data atom stubs within the node at step 502, it proceeds to the beginning of step 502. However, if the present embodiment determines that there are too many deleted data atom stubs within the node at step 502, it proceeds to step 504.

At step 504, the present embodiment determines one or more node identities and sync counter thresholds associated with the pedigrees of the deleted data atom stubs. It should be understood that the determined node identity (or identities) and corresponding sync counter threshold(s) will subsequently be used to completely remove one or more deleted data atom stubs from the node. For instance, any deleted data atom stub that has a node identity (or identities) with a sync counter value(s) within their pedigree equal to or less than the determined sync counter threshold(s) associated with the determined node identity (or identities) is completely removed from the node. For example, given that the sync counter of computer “D” and handheld computer “H” are currently equal to “D136” and “H155,” respectively, the present embodiment may determine that too much storage space within its node is being used by deleted data atom stubs at or below threshold levels “D34” and “H39,” As such, the threshold levels “D34” and “H39” may later be utilized to remove specific deleted data atom stubs from the node.

In step 506, the present embodiment creates a special exclude link which includes the determined node identity (or identities) and sync counter threshold(s) for the deleted data atom stubs. In this manner, when a synchronization occurs between two nodes, the special exclude link of the first node indicates to the other node which deleted data atom stubs were completely removed from the first node. Additionally, the special exclude link may also cause the second node to completely remove those deleted data atoms stubs from itself that correspond to the special exclude link and also cause the creation of its own special exclude link.

At step 508 of FIG. 5, the present embodiment completely removes the deleted data atom stubs that have specific node Identities with sync counters within their pedigrees equal to or less than the determined sync counter threshold(s) associated with the determined node identity (or identities). In this manner, memory space within the node may be freed up for different functionality include, but not limited to, storing other active data atoms and their associated pedigrees. Once step 508 is completed, the present embodiment proceeds to the beginning of step 502.

It is appreciated that depending on the implementation of the advancement of node sync counters, the present embodiment of step 508 may be implemented such that it completely removes the deleted data atom stubs that have specific node identities with sync counters within their pedigrees equal to or greater than the determined sync counter threshold(s) associated with the determined node identity (or identities). As such, step 508 may be implemented in a wide variety of different ways in accordance with the present embodiment.

Accordingly, the present invention provides a method and system for enabling a node to more easily determine which version of a record (if any) takes precedence over one or more other versions of the same record.

The foregoing descriptions of specific embodiments of the present invention have been presented for purposes of illustration and description. They are not intended to be exhaustive or to limit the invention to the precise forms disclosed, and obviously many modifications and variations are possible in light of the above teaching. The embodiments were chosen and described in order to best explain the principles of the invention and its practical application, to thereby enable others skilled in the art to best utilize the invention and various embodiments with various modifications as are suited to the particular use contemplated. It is intended that the scope of the invention be defined by the Claims appended hereto and their equivalents. 

1-27. (canceled)
 28. A node comprising: memory adapted to store one or more data records, the data records being associated with pedigree information indicative of any prior modifications to the data records; a user interface unit for receiving user input with which to enter into a data record residing in the node; and identification logic adapted to identify a data record as having been modified via user input at the node using a pedigree identifier; wherein the pedigree identifier establishes priority of the data as modified by the user input over previous versions of the data record.
 29. The node of claim 28, wherein the pedigree identifier includes at least a node identity designation and a value of a synchronization counter at the node.
 30. The node of claim 29, wherein if the data record includes pedigree identifiers previously associated with the data record at other nodes and the data record has not been previously received at the node, the identification logic is adapted to append the pedigree identifier of the node including the node identifier and synchronization counter value to the previously-placed identifiers.
 31. The node of claim 29, wherein if the data record includes pedigree identifiers previously associated with the data record at other nodes and the data record has been previously received at the node, the identification logic is adapted to update the pedigree identifier of the node with a latest synchronization counter value.
 32. The node of claim 29, further comprising: comparison logic adapted to establish a priority of a first and second versions of a data record by comparing the pedigree identifiers associates with the first and second versions of the data record.
 33. The node of claim 29, further comprising: logic for determining whether a data record has been deleted within the node.
 34. The node of claim 33, further comprising: logic for preserving an identify of the data record, a pedigree identifier, and a deleted status identifier of a deleted data record.
 35. The node of claim 34, wherein the data record, pedigree identifier, and deleted status identifier of the deleted data record are preserved as a recognizable stub.
 36. The node of claim 35, further comprising: counting logic for determining the number of stubs reside on the node.
 37. The node of claim 36, further comprising: determining logic for determining whether the number of stubs residing on the node is greater than a first threshold value; and logic for removing stubs having pedigree identifiers with synchronization counter values below a second threshold value.
 38. The node of claim 29, wherein the one or more records are stored in one or more databases.
 39. The node of claim 29, wherein each database has its own synchronization counter.
 40. A multimode-system in which up-to-date data records are maintained comprising: a first node having a processor, means for inter-node communication, and memory for storing a first version of a data record associated with a first pedigree identifier; a second node having a processor, means for inter-node communication, and memory for storing a second version of the same data record associated with a second pedigree identifier; wherein during a synchronization process in which the first node and second node exchange data records, at least one of the first node and second node is adapted to: compare the first and second pedigree identifiers of the first and second data records; determine which of the first and second versions of the data record have priority based on the comparison; if the first version of the data record is determined to have lower priority, the first node replaces the first version of the data record and the first pedigree identifier with the second version of the data record; and if the second version of the data record is determined to have lower priority, the second node replaces the second version of the data record.
 41. The multi-node system of claim 40, wherein the first pedigree identifier includes at least an identifier of the first node and a value of a synchronization counter at the first node, and the second pedigree identifier includes at least an designation of the second node and a value of a synchronization counter at the second node.
 42. The multi-mode system of claim 41, wherein: if the second version is to replace the first version of the data record at the first node, the first node is adapted to determine if the first pedigree identifier already includes a second node designation; if the first pedigree identifier does not include a second node designation, the first node is adapted append to the first pedigree identifier the second node designation with the synchronization counter value of the second pedigree identifier; and if the first pedigree identifier does include a second node designation, the first node updates the synchronized counter value associated with the second node designation to the synchronization counter value in the second pedigree identifier.
 43. The multi-mode system of claim 41, wherein: if the first version is to replace the second version of the data record at the second node, the second node is adapted to determine if the second pedigree identifier already includes a node designation of the first node; if the second pedigree identifier does not include a first node designation, the second node is adapted append to the second pedigree identifier the first node designation with the synchronization counter value of the second pedigree identifier; and if the second pedigree identifier does include a second node designation, the first node updates the synchronized counter value associated with the second node designation to the synchronization counter value in the second pedigree identifier.
 44. The multi-mode system of claim 41, wherein the first node stores the first version of the data record in a first database, and the second node stores the second version of the data record in a second database.
 45. The multi-node system of claim 41, wherein the first and second databases each have their own synchronization counters.
 46. The multi-mode system of claim 41, wherein, during a synchronization process, the first node is adapted to determine whether data records have been deleted from the second node, and the second node is adapted to determine whether data records have been deleted from the first node.
 47. The multi-mode system of claim 46, wherein the first node stores a data record identifier, a pedigree identifier, and a deleted status identifier of each data record deleted on the first node, and the second node stores a data record identifier, a pedigree identifier, and a deleted status identifier of each data record deleted on the second node.
 48. The multi-mode system of claim 47, wherein the first and second nodes preserve the data record, pedigree identifier, and deleted status identifiers of the deleted data record are preserved as recognizable stubs.
 49. The multi-mode system of claim 47, wherein the first and second nodes are each adapted to determine whether a number of stubs residing on their respective nodes exceed a threshold value, and to remove a number of stubs if it is so determined.
 50. The multi-mode system of claim 47, wherein the first and second nodes are each adapted to remove stubs having pedigree identifiers with synchronization counter values below another threshold value. 